Construction and Convergence of the C-S Combined Mean Method for Multiple Polynomial Zeros

نویسندگان

چکیده

In this article, we have combined two well known third order methods one is Chebyshev and another Super- Halley to form an iterative method of for solving polynomial equations with multiple zeros. This constructed basically the mean Super-Halley, so name as C-S Combined Mean Method. We proposed some local convergence theorems Method establish computation a For establishment theorem, key role performed by function(Real valued) termed function initial conditions. Function conditions I mapping from set D into M , where (subset ) domain scheme. Here uses information only at point are given in I(w0) which belongs J interval on positive real line also contains 0 w0 starting point. used notion gauge plays very important establishing theorem. types over arbitrary normed field established method. The error estimations found our analysis. simple zero, results hold good.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inequalities for the polar derivative of a polynomial with $S$-fold zeros at the origin

‎Let $p(z)$ be a polynomial of degree $n$ and for a complex number $alpha$‎, ‎let $D_{alpha}p(z)=np(z)+(alpha-z)p'(z)$ denote the polar derivative of the polynomial p(z) with respect to $alpha$‎. ‎Dewan et al proved‎ ‎that if $p(z)$ has all its zeros in $|z| leq k, (kleq‎ ‎1),$ with $s$-fold zeros at the origin then for every‎ ‎$alphainmathbb{C}$ with $|alpha|geq k$‎, ‎begin{align*}‎ ‎max_{|z|=...

متن کامل

construction and validation of the translation teacher competency test and the scale of students’ perceptions of translation teachers

the major purpose of this study was to develop the translation teacher competency test (ttct) and examine its construct and predictive validity. the present study was conducted in two phases: a qualitative phase as well as a quantitative phase. in the first phase of the study, the author attempted to find out the major areas of competency required for an academic translation teacher. the second...

Convergence of the Weierstrass Method for Simultaneous Approximation of Polynomial Zeros

In 1891, Weierstrass presented his famous iterative method for finding all the zeros of a polynomial simultaneously. In this paper we establish three new local convergence theorems for the Weierstrass method with a posteriori and a priori error estimates. The main result of the paper generalizes, improves and complements some well known results of Dochev (1962), Kjurkchiev and Markov (1983) and...

متن کامل

On the Convergence Rate of Symmetric Single-Step Method ISS for Simultaneous Bounding Polynomial Zeros

A new modified method ISS for the simultaneous bounding all the zeros of a polynomial is formulated in this paper. The efficiency of this method is measured on the CPU times and the number of iterations after satisfying the convergence criteria where the results are obtained using five tested polynomials. The R-order of convergence of this method is at least 9. Mathematics Subject Classificatio...

متن کامل

Filomat 17 (2003), 155–168 Derivative Free Combined Method for the Simultaneous Inclusion of Polynomial Zeros

Abstract. A combined method for the simultaneous inclusion of complex zeros of a polynomial, composed of two circular arithmetic methods, is presented. This method does not use polynomial derivatives and has the order of convergence equals four. Computationally verifiable initial conditions that guarantee the convergence are also stated. Two numerical example are included to demonstrate the con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Asian research journal of mathematics

سال: 2023

ISSN: ['2456-477X']

DOI: https://doi.org/10.9734/arjom/2023/v19i9709